#include<conio.h>
#include<iostream.h>
void main(void)
{
  clrscr();
  int A[10]={10,5,78,4,6,0,-9,4,47,5798},i,j,temp;
  int mid,min,max,found=0,value=3;
//***********************Sort******************************
//  for (i=0;i<=9;i++)
//  {
//     cin>>A[i];
//  }
  for (i=0;i<=9;i++)
     for (j=i;j<=9;j++)
     {
  if (A[i]>A[j])
  {
      temp=A[i];
      A[i]=A[j];
      A[j]=temp;
  }
     }
//*******************Sort End******************************
//*******************Bineri Search*************************
  min=0;
  max=9;
  do
  {
     mid=(max+min)/2;
     if(A[mid]==value)  found=1;
     else if(A[mid]<value) min=mid+1;
     else max=mid-1;
  }
  while (found==0&min<=max);
  if (found) cout<<"Found in:  "<<mid+1;
    else cout<<"Not found";
//****************End Search*******************************
  getch();
}